Separation of Test-Free Propositional Dynamic Logics over Context-Free Languages
نویسنده
چکیده
For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows programs to be in a language of L rather than just to be regular. If L contains a non-regular language, PDL[L] can express non-regular properties, in contrast to pure PDL. For regular, visibly pushdown and deterministic context-free languages, the separation of the respective PDLs can be proven by automata-theoretic techniques. However, these techniques introduce non-determinism on the automata side. As non-determinism is also the difference between DCFL and CFL, these techniques seem to be inappropriate to separate PDL[DCFL] from PDL[CFL]. Nevertheless, this separation is shown but for programs without test operators.
منابع مشابه
Propositional dynamic logic of context-free programs and fixpoint logic with chop
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former. This relationship transfers several decidability and complexity results between the two logics.
متن کاملThe Expressivity of Tree Languages for Syntactic Structures
In this paper, we investigate the expressivity of a series of languages describing syntactic structures, i.e. labeled ordered trees. Such a tree language states a formalism to describe certain sets of trees. We apply them to represent syntactic principles recently used in some theories of syntax. An investigation of the expressivity establishes the relationship to appropriate types of formal gr...
متن کاملDynamic languages of propositional control for protocol specification
We propose a family of dynamic logics of propositional control. They extend classical propositional logic by a variety of modal operators of assignment, and modal operators of transfer of control over a propositional variable. We also present an extension with operators of knowledge. We essentially focus on their formal properties, stating their complexity and their proof theory.
متن کاملContext - Free Term Sets are Regular - andSome Applications
We prove that all context-free sets of terms are regular tree languages, a natural conjecture formulated in Mat97]. We motivate our interest in this language-theoretic result with two issues. First in automated model building it is desirable to characterize the power of context-free languages to represent single Herbrand models, which we conclude to be exactly the nite models. Second in proposi...
متن کاملStrong Completeness for Iteration-Free Coalgebraic Dynamic Logics
We present a (co)algebraic treatment of iteration-free dynamic modal logics such as Propositional Dynamic Logic (PDL) and Game Logic (GL), both without star. The main observation is that the program/game constructs of PDL/GL arise from monad structure, and the axioms of these logics correspond to certain compatibilty requirements between the modalities and this monad structure. Our main contrib...
متن کامل